An Algorithmic Theory of Lattice Points in Polyhedra
نویسندگان
چکیده
We discuss topics related to lattice points in rational polyhedra, including efficient enumeration of lattice points, “short” generating functions for lattice points in rational polyhedra, relations to classical and higher-dimensional Dedekind sums, complexity of the Presburger arithmetic, efficient computations with rational functions, and others. Although the main slant is algorithmic, structural results are discussed, such as relations to the general theory of valuations on polyhedra and connections with the theory of toric varieties. The paper surveys known results and presents some new results and connections.
منابع مشابه
Some Algorithmic Problems in Polytope Theory
Convex polyhedra, i.e., the intersections of finitely many closed affine halfspaces inRd, are important objects in various areas of mathematics and other disciplines. In particular, the compact ones among them (polytopes), which equivalently can be defined as the convex hulls of finitely many points in Rd, have been studied since ancient times (e.g., the platonic solids). Polytopes appear as bu...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملLattice Polytopes in Algebra ,
[1] Victor V. Batyrev and Benjamin Nill. Multiples of lattice polytopes without interior lattice points. Moscow Mathematical Journal 7:195–207, 2007. [2] Victor V. Batyrev, Benjamin Nill. Combinatorial aspects of mirror symmetry. Contemporary Mathematics, 452:35–66, 2008. [3] Barbara Baumeister, Christian Haase, Benjamin Nill and Andreas Paffenholz. On permutation polytopes. Advances in Mathema...
متن کاملTwo-lattice polyhedra: duality and extreme points
Two-lattice polyhedra are a special class of lattice polyhedra that include network 4ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyhedron is equal to the minimum capacity of a cover for the polyhedron. For special classes of 2-lattice ...
متن کاملCAYLEY DECOMPOSITIONS OF LATTICE POLYTOPES AND UPPER BOUNDS FOR h-POLYNOMIALS
We give an effective upper bound on the h-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem which says, roughly speaking, that any lattice polytope with a large multiple that has no interior lattice points has a nontrivial decomposition as a Cayley su...
متن کامل